Conjugate gradient methods for continuation problems

An Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems

In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...

Bit on Conjugate Gradient like Methods for Eigen like Problems

Numerical analysts physicists and signal processing engineers have proposed algo rithms that might be called conjugate gradient for problems associated with the com putation of eigenvalues There are many variations mostly one eigenvalue at a time though sometimes block algorithms are proposed Is there a correct conjugate gradi ent algorithm for the eigenvalue problem How are the algorithms rela...

Multilevel Conjugate Gradient Methods

Application of frames in Chebyshev and conjugate gradient methods

‎Given a frame of a separable Hilbert space $H$‎, ‎we present some‎ ‎iterative methods for solving an operator equation $Lu=f$‎, ‎where $L$ is a bounded‎, ‎invertible and symmetric‎ ‎operator on $H$‎. ‎We present some algorithms‎ ‎based on the knowledge of frame bounds‎, ‎Chebyshev method and conjugate gradient method‎, ‎in order to give some‎ ‎approximated solutions to the problem‎. ‎Then we i...

Conjugate Gradient Methods for Toeplitz Systems

A list of technical reports, including some abstracts and copies of some full reports may be found at: Object test coverage using finite state machines. September 1995. On balancing workload in a highly mobile environment. August 1995. Error analysis of a partial pivoting method for structured matrices. June 1995. Abstract In this expository paper, we survey some of the latest developments on u...